منابع مشابه
Hyperbolic Julia Sets are Poly-Time Computable
In this paper we prove that hyperbolic Julia sets are locally computable in polynomial time. Namely, for each complex hyperbolic polynomial p(z), there is a Turing machine Mp(z) that can “draw” the set with the precision 2 −n, such that it takes time polynomial in n to decide whether to draw each pixel. In formal terms, it takes time polynomial in n to decide for a point x whether d(x, Jp(z)) <...
متن کاملContinuity of Hausdorff Dimension of Julia-lavaurs Sets as a Function of the Phase
Let f0(z) = z2 + 1/4 and E0 the set of phases σ such that the critical point 0 escapes in one step by the Lavaurs map gσ ; it is a topological strip in the cylinder of phases whose boundary consists of two Jordan curves symmetric wrt R/Z. We prove that if σn ∈ E0 converges to σ ∈ ∂E0 in such a way that gσn (0) converges to gσ(0) along an external ray, then the Hausdorff dimension of the Julia-L...
متن کاملThe Measure of Quadratic Julia-lavaurs Sets with a Bounded Type Virtual Siegel Disk Is Zero
1.1. In short. — Let p/q be an irreducible fraction (q > 0). Let us define the polynomial P (z) = ez + z. It is well known that the parabolic fixed point z = 0 is the only non repelling periodic point of P , and moreover that it has precisely q repelling petals. The action of P on the (repelling) Écalle-Voronin cylinders is therefore transitive. We will choose one end of these cylinders and cal...
متن کاملA Fast Algorithm for Julia Sets of Hyperbolic Rational Functions
Although numerous computer programs have been written to compute sets of points which claim to approximate Julia sets, no reliable high precision pictures of nontrivial Julia sets are currently known. Usually, no error estimates are added and even those algorithms which work reliable in theory, become unreliable in practice due to rounding errors and the use of fixed length floating point numbe...
متن کاملComputational Complexity of Euclidean Sets : Hyperbolic Julia Sets are Poly - Time Computable
Computational Complexity of Euclidean Sets: Hyperbolic Julia Sets are Poly-Time Computable Mark Braverman Master of Science Graduate Department of Computer Science University of Toronto 2004 We investigate different definitions of the computability and complexity of sets in R, and establish new connections between these definitions. This allows us to connect the computability of real functions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae
سال: 2001
ISSN: 0019-3577
DOI: 10.1016/s0019-3577(01)80032-x